Towards Proofs as Successful Executions of Processes
نویسندگان
چکیده
We further the understanding of the relationship between process calculi and non-commutative logic. This work focuses on, a first-order extension of the proof calculus BV featuring a de Morgan dual pair of nominal quantifiers, called BV1. An embedding of π-calculus process as predicates in BV1 is defined, and a procedure is provided for extracting successful executions from proofs of embedded processes. This procedure is used to establish the soundness of linear implication in BV1 with respect to trace inclusion in the π-calculus. We illustrate the expressive power of BV1, by demonstrating that these techniques extend also to the internal π-calculus, where privacy of inputs are guaranteed. We emphasise that linear implication is strictly finer than trace inclusion, providing a tight refinement semantics for processes respecting both causality and the scope of private names.
منابع مشابه
Counting-Based Impossibility Proofs for Renaming and Set Agreement
Renaming and set agreement are two fundamental subconsensus tasks. In the M-renaming task, processes start with names from a large domain and must decide on distinct names in a range of size M ; in the k-set agreement task, processes must decide on at most k of their input values. Renaming and set agreement are representatives of the classes of colored and colorless tasks, respectively. This pa...
متن کاملProofs as Executions
This paper proposes a new interpretation of the logical contents of programs in the context of concurrent interaction, wherein proofs correspond to valid executions of a processes. A type system based on linear logic is used, in which a given process has many different types, each typing corresponding to a particular way of interacting with its environment and cut elimination corresponds to exe...
متن کاملProofs as executions ( rapport interne LIPN -
This paper proposes a new interpretation of the logical contents of programs in the context of concurrent interaction, wherein proofs correspond to valid executions of a processes. A type system based on linear logic is used, in which a given process has many different types, each typing corresponding to a particular way of interacting with its environment and cut elimination corresponds to exe...
متن کاملConcurrent processes as wireless proof nets
We present a proofs-as-programs correspondence between linear logic and process calculi that permits non-deterministic behaviours. Processes are translated into wireless proof nets, i.e. proof nets of multiplicative linear logic without cut wires. Typing a term using them consists in typing some of its possible determinisations in standard sequent calculus. Generalized cut-elimination steps in ...
متن کاملInformation from Deduction: Models and Proofs
This report documents the program and the outcomes of Dagstuhl Seminar 15381 “Information from Deduction: Models and Proofs”. The aim of the seminar was to bring together researchers working in deduction and applications that rely on models and proofs produced by deduction tools. Proofs and models serve two main purposes: (1) as an upcoming paradigm towards the next generation of automated dedu...
متن کامل